Index Coding Algorithms: Cooperative Caching and Delivery for F-RANs

نویسندگان

چکیده

In a Fog Radio Access Network (F-RAN), fog access points (F-APs) are equipped with caches that can store popular files during off-peak hours. Besides, they densely deployed to have overlapping radio coverage so requested be delivered cooperatively using beamforming. The bottleneck of the network is typically in bandwidth-limited wireless fronthaul, which connects cloud server F-APs. This work studies index coding design for cooperative caching and delivery F-RAN minimize fronthaul traffic transmit energy. Index algorithms designed considering cached content at F-APs possibility beamforming under coded uncoded schemes. An optimal polynomial-time algorithm repetition an efficient heuristic Maximum Distance Separable (MDS) designed, their superior performance verified by simulations. study further extended consider tradeoff between load link energy consumed network. At expense more traffic, opportunities increased, significantly reducing consumption. Algorithms achieve crafted, simulation results show well balances tradeoff.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order Optimal Coded Delivery and Caching: Multiple Groupcast Index Coding

The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The p...

متن کامل

Placement Algorithms for Hierarchical Cooperative Caching and Other Location Problems

In a large-scale information system, such as a digital library or the world wide web, a set of distributed caches can improve their e ectiveness by cooperating with one another, both in serving each other's requests as well as in deciding what to store. This dissertation explores the potential of such cooperative caching, and provides basic placement algorithms using which the caches can coordi...

متن کامل

Cooperative Multi-Sender Index Coding

In this paper, we establish new capacity bounds for the multi-sender unicast index-coding problem. We first revisit existing outer and inner bounds proposed by Sadeghi et al. and identify their suboptimality in general. We then propose a new multi-sender maximal-acyclic-induced-subgraph outer bound that improves upon the existing bound in two aspects. For inner bound, we identify shortcomings o...

متن کامل

Fast Query Processing Using Cooperative CPU Caching for Index Structures

Index data structures are an important component of database applications. Our measurements show that for a memory resident CSB+-tree (Cache Sensitive B+ tree), the cache miss penalty now accounts for over 50% of the total running time. This is exacerbated by current trends. As a result of Moore’s law, both the CPU speed and the DRAM density have doubled every 18 months. However the cache miss ...

متن کامل

Coding-Based Cooperative Caching in Data Broadcast Environments

Data broadcasting has been commonly deployed in many emerging mobile applications such as intelligent transportation systems and locationbased services because it is a scalable approach to disseminating information from the mobile support station (MSS) to a large population of mobile hosts (MHs). To provide timely data access and better data availability, MHs can store data items broadcast by t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Vehicular Technology

سال: 2022

ISSN: ['0018-9545', '1939-9359']

DOI: https://doi.org/10.1109/tvt.2022.3194976